Dual-based heuristics for a hierarchical covering location problem
نویسندگان
چکیده
A 2-level hierarchical extension of the maximal covering location problem is considered and an e0ective method for its solution developed. A combined Lagrangean–surrogate (L–S) relaxation is de6ned which reduces to a 0–1 knapsack problem. Tests were carried out using a subgradient-based heuristic incorporating the L–S relaxation, with the resulting knapsack problems being solved both with and without the integrality constraints relaxed. Results were obtained for test problems available in the literature ranging from 55-node to 700-node networks. These were compared, where possible, with exact results obtained using CPLEX. It was found that computing times were reasonable.
منابع مشابه
Hub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملOptimizing a Hierarchical Hub Covering Problem with Mandatory Dispersion of Central Hubs
The hierarchical hub location problem is encountered three-level network that is applied in production-distribution system, education system, emergency medical services, telecommunication network, etc. This paper addresses the hierarchical hub covering problem with single assignment accounting for mandatory dispersion of central hubs restriction as a special case. This formulation with incorpor...
متن کاملSingle Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...
متن کاملDeveloping a New Bi-Objective Functions Model for a Hierarchical Location-Allocation Problem Using the Queuing Theory and Mathematical Programming
In this research, a hierarchical location-allocation problem is modeled in a queue framework. The queue model is considered as M/M/1/k, in which system capacity is finite, equals to k. This is the main contribution of the current research. Customer's enters to the system in order to find the service according to a Poisson. In this problem, the hierarchical location-allocation model is considere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 30 شماره
صفحات -
تاریخ انتشار 2003